منابع مشابه
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملVerification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Koml os has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge costs is a minimum spanning tree. The total computational work required by his method is much larger than linear, however. We describe a linear-time algorithm for verifying a minimum spanning tree. Our algorithm combines the result of Koml os with a preprocessing and...
متن کاملNear-linear Time Algorithms for Approximate Minimum Degree Spanning Trees
Given a graph G = (V,E), n = |V |,m = |E|, we wish to compute a spanning tree whose maximum vertex degree is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the approximation version of this problem, a Õ(mn) time algorithm that computes a spanning tree of degree at most ∆∗+1 is previously known [Fürer, Rag...
متن کاملVariations for spanning trees
Coursebooks discussing graph algorithms usually have a chapter on minimum spanning trees. It usually contains Prim’s and Kruskal’s algorithms [1, 2] but often lacks other applications. This type of problem is rarely present at informatics competitions or in tests in secondary or higher level informatics education This article is aimed at describing some competition tasks that help us prove that...
متن کاملApproximating Maximum Leaf Spanning Trees in Almost Linear Time
Given an undirected graph nding a spanning tree of the graph with maximum number of leaves is MAX SNP complete In this paper we give a new greedy approximation algorithm for maximum leaf spanning trees The running time O m n m n required by our algorithm where m is the number of edges and n is the number of nodes is almost linear in the size of the graph We also demonstrate that our analysis of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1985
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02579443